m=3
n=3
def uniquePaths(m,n):
    dp=[[1 for _ in range(n)] for _ in range(m)]

    for i in range(1,m):
        for j in range(n):
            if i>0 and i<m and j>0 and j<n:
                dp[i][j]=dp[i-1][j]+dp[i][j-1]
    print(dp)
    return dp[m-1][n-1]
print(uniquePaths(m,n))
